Boundedness and K for Log Surfaces

نویسنده

  • VALERY ALEXEEV
چکیده

0. Introduction 1 1. Standard definitions 3 2. Examples 4 3. Some methods for proving boundedness 8 4. Additional definitions and easy technical results 9 5. The diagram method 10 6. Boundedness for surfaces with nef −(K+B) 14 7. Boundedness for surfaces with big and nef K +B 18 8. Descending Chain Condition 23 9. Boundedness for the constant (K +B)2 27 10. On log MMP for surfaces 28 11. Concluding remarks, generalizations, open questions 30 References 31

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Bounding singular surfaces of general type

We provide simpler proofs of several boundedness theorems, contained in in articles [2], [3], for log surfaces of general type with semi log canonical singularities. At the same time, we make these proofs e ective, with explicit upper bounds.

متن کامل

A Boundedness Result for Toric Log Del Pezzo Surfaces

In this paper we give an upper bound for the Picard number of the rational surfaces which resolve minimally the singularities of toric log Del Pezzo surfaces of given index l. This upper bound turns out to be a quadratic polynomial in the variable l.

متن کامل

ALGEBRAIC SURFACES WITH LOG-TERMINAL SINGULARITIES AND nef ANTICANONICAL CLASS AND REFLECTION GROUPS IN LOBACHEVSKY SPACES. I. (BASICS OF THE DIAGRAM METHOD)

In our preprint: ”Algebraic surfaces with log terminal singularities and nef anticanonical class and reflection groups in Lobachevsky spaces”, Preprint MaxPlanck-Institut für Mathematik, Bonn, (1989) MPI/89-28 (Russian), we had extended the diagram method to algebraic surfaces with nef anticanonical class (before, it was applied to Del Pezzo surfaces). The main problem here is that Mori polyhed...

متن کامل

Undecidable Boundedness Problems for Datalog Programs

A given Datalog program is bounded if its depth of recursion is independent of the input database. Deciding boundedness is a basic task for the analysis of database logic programs. The undecidability of Datalog boundedness was rst demonstrated by Gaifman et al. We introduce new techniques for proving the undecidability of various kinds of boundedness, which allow us to considerably strengthen t...

متن کامل

Constrained Seismic Sequence Stratigraphy of Asmari - Kajhdumi interval with well-log Data

Sequence stratigraphy is a key step in interpretation of the seismic reflection data. It was originally developed by seismic specialists, and then the usage of high-resolution well logs and core data was taken into consideration in its implementation. The current paper aims in performing sequence stratigraphy using three-dimensional seismic data, well logs (gamma ray, sonic, porosity, density, ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1994